Arbitrary degree distribution networks with perturbations
نویسندگان
چکیده
منابع مشابه
Partitioning and modularity of graphs with arbitrary degree distribution.
We solve the graph bipartitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut size to scale universally with . In contrast, earlier results studying the problem in graphs with a Poissonian degree distribution had found a scaling with square root [Fu and Anderson, J. Phys. A 19, 1605 (1986)]. Our results also generalize...
متن کاملA Simple Model for Complex Networks with Arbitrary Degree Distribution and Clustering
We present a stochastic model for networks with arbitrary degree distributions and average clustering coefficient. Many descriptions of networks are based solely on their computed degree distribution and clustering coefficient. We propose a statistical model based on these characterizations. This model generalizes models based solely on the degree distribution and is within the curved exponenti...
متن کاملComponent sizes in networks with arbitrary degree distributions.
We give an exact solution for the complete distribution of component sizes in random networks with arbitrary degree distributions. The solution tells us the probability that a randomly chosen node belongs to a component of size s for any s . We apply our results to networks with the three most commonly studied degree distributions-Poisson, exponential, and power-law-as well as to the calculatio...
متن کاملTuning clustering in random networks with arbitrary degree distributions.
We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure...
متن کاملIsing Model on Networks with an Arbitrary Distribution of Connections
We find the exact critical temperature T(c) of the nearest-neighbor ferromagnetic Ising model on an "equilibrium" random graph with an arbitrary degree distribution P(k). We observe an anomalous behavior of the magnetization, magnetic susceptibility and specific heat, when P(k) is fat tailed, or, loosely speaking, when the fourth moment of the distribution diverges in infinite networks. When th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIP Advances
سال: 2021
ISSN: 2158-3226
DOI: 10.1063/5.0031500